Geometrical Considerations on Hard Core Problems
نویسندگان
چکیده
منابع مشابه
Hard-Core Distributions for Somewhat Hard Problems
Consider a decision problem that cannot be 1 ? approximated by circuits of a given size in the sense that any such circuit fails to give the correct answer on at least a fraction of instances. We show that for any such problem there is a speciic \hard-core" set of inputs which is at least a fraction of all inputs and on which no circuit of a slightly smaller size can get even a small advantage ...
متن کاملGlassy behavior induced by geometrical frustration in a hard-core lattice-gas model
– We introduce a hard-core lattice-gas model on generalized Bethe lattices and investigate analytically and numerically its compaction behavior. If compactified slowly, the system undergoes a first-order crystallization transition. If compactified much faster, the system stays in a meta-stable liquid state and undergoes a glass transition under further compaction. We show that this behavior is ...
متن کاملModeling of Spray-Formed Materials: Geometrical Considerations
suming and not economical. Hence, computer simulation is SPRAY forming is a manufacturing technique in which a useful approach to investigatingthe formationand developpartially solidified metal droplets are dispersed upon a subment of round billets. Several mathematical models have strate to produce an almost fully dense material in tonnage been developedto calculate the growth of round billets...
متن کاملOn Some Hard Problems on Matroid Spikes
Spikes form an interesting class of 3-connected matroids of branch-width 3. We show that some computational problems are hard on spikes with given matrix representations over infinite fields. Namely, the question whether a given spike is the free spike is co-NP -hard (though the property itself is definable in monadic second-order logic); and the task to compute the Tutte polynomial of a spike ...
متن کاملHard Instances of Hard Problems
This paper investigates the instance complexities of problems that are hard or weakly hard for exponential time under polynomial time many one reductions It is shown that almost every instance of almost every problem in exponential time has essentially maximal instance complexity It follows that every weakly hard problem has a dense set of such maximally hard instances This extends the theorem ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Progress of Theoretical Physics
سال: 1974
ISSN: 0033-068X,1347-4081
DOI: 10.1143/ptp.51.399